Constructing Infinite One-regular Graphs
نویسندگان
چکیده
منابع مشابه
CONSTRUCTING INFINITE ONE - REGULAR GRAPHSAleksander
Austria Abstract A graph is said to be one-regular if its automorphism group acts regularly on the set of its arcs. A construction of an innnite family of innnite one-regular graphs of valency 4 is given. These graphs are Cayley graphs of almost abelian groups and hence of polynomial growth.
متن کاملConstructing an Infinite Family of Cubic 1-Regular Graphs
A graph is 1-regular if its automorphism group acts regularly on the set of its arcs. Miller [J. Comb. Theory, B, 10 (1971), 163–182] constructed an infinite family of cubic 1-regular graphs of order 2p, where p ≥ 13 is a prime congruent to 1 modulo 3. Marušič and Xu [J. Graph Theory, 25 (1997), 133– 138] found a relation between cubic 1-regular graphs and tetravalent half-transitive graphs wit...
متن کاملOn Constructing Regular Distance-Preserving Graphs
Let G be a simple, connected graph on n vertices. Let dG(u, v) denote the distance between vertices u and v in G. A subgraph H of G is isometric if dH(u, v) = dG(u, v) for every u, v ∈ V (H). We say that G is a distancepreserving graph if G contains at least one isometric subgraph of order k for every k, 1 ≤ k ≤ n. In this paper we construct regular distance-preserving graphs of all possible or...
متن کاملConstructing regular graphs with smallest defining number
In a given graph G, a set S of vertices with an assignment of colors is a defining set of the vertex coloring of G, if there exists a unique extension of the colors of S to a χ(G)-coloring of the vertices of G. A defining set with minimum cardinality is called a smallest defining set (of vertex coloring) and its cardinality, the defining number, is denoted by d(G, χ). Let d(n, r, χ = k) be the ...
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1999
ISSN: 0195-6698
DOI: 10.1006/eujc.1999.0338